Nearly m-embedded subgroups and solvability of finite groups

A subgroup A of a finite group G is called {1≤G}-embedded in G if for each two subgroups K≤H of G, where K is a maximal subgroup of H, A either covers the pair (K,H) or avoids it. Moreover, a subgroup H of G is called nearly m-embedded in G if G has a subgroup T and a {1≤G}-embedded subgroup C such that G?=?HT and H∩T≤C≤H. In this paper, we mainly prove that G is solvable if and only if its Sylow 3-subgroups, Sylow 5-subgroups and Sylow 7-subgroups are nearly m-embedded in G.     

Koszul filtrations and finite lattices

In this note, we characterize when a finite lattice is distributive in terms of the existences of some particular classes of Koszul filtrations.     

Mixed two‐grid finite difference methods for solving one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations

The aim of this paper is to propose mixed two‐grid finite difference methods to obtain the numerical solution of the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. The finite difference equations at all interior grid points form a large‐sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a family of finite difference methods for discretizing the spatial and time derivatives. The obtained system has been solved by two‐grid method, where the two‐grid method is used for solving the large‐sparse linear systems. Also, in the proposed method, the spectral radius with local Fourier analysis is calculated for different values of h and Δt. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. Copyright © 2016 John Wiley & Sons, Ltd.     

Quenching phenomenon of a time‐fractional diffusion equation with singular source term

In this paper, a time‐fractional diffusion equation with singular source term is considered. The Caputo fractional derivative with order 0<α ?1 is applied to the temporal variable. Under specific initial and boundary conditions, we find that the time‐fractional diffusion equation presents quenching solution that is not globally well‐defined as time goes to infinity. The quenching time is estimated by using the eigenfunction of linear fractional diffusion equation. Moreover, by implementing a finite difference scheme, we give some numerical simulations to demonstrate the theoretical analysis. Copyright © 2017 John Wiley & Sons, Ltd.     

A nonstandard finite difference method for solving a mathematical model of HIV-TB co-infection

We design and analyze an unconditionally convergent nonstandard finite-difference method to study transmission dynamics of a mathematical model of HIV-TB co-infection. The dynamics of this model are studied using the qualitative theory of dynamical systems. These qualitative features of the continuous model are preserved by the numerical method that we propose in this paper. This method also preserves positivity of the solution which is one of the essential requirements when modelling epidemic diseases. Furthermore, we show that the numerical method is unconditionally stable. Competitive numerical results confirming theoretical investigations are provided. Comparisons are also made with other conventional approaches that are routinely used to solve these types of problems.     

The graph structure of a deterministic automaton chosen at random

An n‐state deterministic finite automaton over a k‐letter alphabet can be seen as a digraph with n vertices which all have k labeled out‐arcs. Grusho (Publ Math Inst Hungarian Acad Sci 5 (1960), 17–61). proved that whp in a random k‐out digraph there is a strongly connected component of linear size, i.e., a giant, and derived a central limit theorem. We show that whp the part outside the giant contains at most a few short cycles and mostly consists of tree‐like structures, and present a new proof of Grusho's theorem. Among other things, we pinpoint the phase transition for strong connectivity. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 428–458, 2017     

Constacyclic codes over finite local Frobenius non-chain rings with nilpotency index 3

The main results of this paper are in two directions. First, the family of finite local Frobenius non-chain rings of length 4 (hence of nilpotency index 3) is determined. As a by-product all finite local Frobenius non-chain rings with $p^4$ elements, (p a prime) are given. Second, the number and structure of γ-constacyclic codes over finite local Frobenius non-chain rings with nilpotency index 3, of length relatively prime to the characteristic of the residue field of the ring, are determined.